
/*
*Pool Public Licence version 0.1 or later
*Released on 20th April 2008.
*Any voilations can be repoted at paritosh@wikiocean.net
*What is treated as voilations can be found at www.wikiocean.net/ppl1-voilations* 
******************************************************************************
* The contents of this file are subject Affero GPL v3 and later with additional conditions.
* The additional conditions are to be considered as part of the Affero GPL v3 and later.
* The additional conditions will supersede the Affero GPLv3 and later in case of conflict.
* ("License"); You may not use this file except in compliance with the License
* You may obtain a copy of the License at http://www.gnu.org/licenses/agpl.html
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License for
* the specific language governing rights and limitations under the License.
* The Initial Developer of the Original Code is Paritosh Pungaliya.
* created by Paritosh Pungaliya are Copyright (C) Paritosh Pungaliya; All Rights Reserved.
* Contributions are Copyright (C) 2001-2008 Paritosh Pungaliya.

* Objective of the additional terms (license) 
* 1) Is to extend the software freedom to freedom to work.
* 2) To ensure that knowledge is free from monopoly of agencie(s).
* 3) To avoid a situation where big corporates or investors can buy out free software groups and companies and then start milking the communities built around it.
* (this trend can be seen how the openness changes in companies that get Venture Capital funding.)
* (if you agree to this logic I invite you to our group to work together)

* Additional conditions
*  0) Source code will also include
* 	a) data dictionaries, data ontologies which are used to alter the behavior of code or to control           the features of application.
* 	b) Any code generated or derived automatically or manually from this code or logic
*  1) The revenue generated by deploying, implementing , selling services and other activities
*  	 based on this source code should be shared 100%, between the people working on it.
*  2) Capital invested should be given only fixed rate of return or linked to revenue/surplus growth for limited time.
*  3) People working on the project should always have an option to replace the capital provider in full or part with lower cost capital.
*  4) Their should not be any ownership which can be sold as a claim on future profit to be generated from the work of people working on the code.
*  5) Brand thus generated should belong to the group.
*  6) For old and new members revenue sharing should be equal for same work equivalent.
*  7) The share of revenue should be decided by bidding for work before allocation of work within the group.
*  8) Before bidding various method of measuring the work should be clearly defined and published in public domain. Any change in process should also be publised in public domain imediately.
*  9) All data related to to revenue sharing should be published as and when generated in public domain.
*  10) For group of people having size more than 10 people will have to make it open online for others to participate in bids. 
*  11) All people involved in related and sub project will be treated as a group.
*  12) Once this license is being used for a certain code then all and any other software services being provided by the group should complusorilly come under 100% revenue sharing.
*  13) Cross subsidization should not happen under this revenue share, no additional benefit should be drawn from the people, by the employing agency.
*  14) Any position or knowledge or legal structure created relating to people working on code, which adversely affects the spirit of 100% revenue share will be treated as a violation.
*  15) Revenue sharing defined.
*     a) includes direct revenue and also intangible gains like brand, and organization.
*     b) No personal judgment should be involved in judging the distribution of revenue.It has to be pre-defined formula based.
*     c)100% of revenue should be shared before expenses and recievers should have control over what expenses to incur.
*     d)For the work done in any month by contributing group member, working on any project can be given revenue share from the work done by the group, for a maximum of 18 months after that month.
*     e)Revenue should be apportioned to the month in which work is done and not when received.
*  The group fulfilling the above conditions also has to be a wiki ecosystem further defined in www.wekosystem.org or read about Wekosystem at www.wikiocean.net

*  ******************************************************************************
*/  
package combinereport.query;

import java.util.Enumeration;
import java.util.Hashtable;
import java.util.Map;
import java.util.Vector;

import property.Order;
import sort.Sortinterface;
import utility.CapitalChar;
import utility.Input;
import utility.MergedBuffer;
import utility.Splitstring;
import database.RecordSearch;
import dbmanager.Column;
import dbmanager.DBManager;
import dbmanager.GetIdName;
import file.SearchRecord;

public class Outerjoin implements Queryinterface
{

	DBManager database;
	GetIdName gid;
	//String [] buffer2;
	String [] buffer1;
	String[] Querybuffer;
	String JOIN ="join";
	String Message;
	String object;
	String LHS="lhs";
	String RHS="rhs";
	String reporton;
	String conditionopeartor="conditionopeartor";
	StringBuffer heading = new StringBuffer(); 
	int index1[];
	int index2[];
	Hashtable<Object, Object> joinmap = new Hashtable<Object, Object>();
	String tablename;
	int indexofbuffer1=-1;
	int indexofbuffer2=-1;
	String key="no$";
	String value="no$";
	String Reportname;
	Hashtable<Object, Object > Querymap = new Hashtable<Object, Object>();
	String tid;
	
	public void setObject(String object)
	{
		this.object = object; 
	}
	
	public void getResult()
	{	
		String lhs = joinmap.get(LHS).toString().toLowerCase();
		String rhs = joinmap.get(RHS).toString().toLowerCase();
	//	String heading1 =  Addprefix.removerefix(buffer1[0]);
		String heading1 =  (buffer1[0]);
		//String heading2 = Addprefix.removerefix(Querybuffer[0]);
		//String lOgicaloperator = joinmap.get(conditionopeartor).toString();
		indexofbuffer1 = getFieldinbuffer(heading1,rhs);
		indexofbuffer2 = getFieldinbuffer(Querybuffer[0],lhs);
		Vector<Object>tempmap=new Vector<Object>();
		tempmap.add(Integer.toString(indexofbuffer1));	
		try {
			Sortinterface sort;
			Class c = Class.forName("sort."+CapitalChar.makeFirstCharCapital("Ascending"));
			sort = (Sortinterface) c.newInstance();
			sort.setbuffer(buffer1);
			sort.setVector(tempmap,1);
			sort.getResult();
			buffer1 = sort.getbuffer();			
			tempmap.clear();
		} catch (ClassNotFoundException e) 
		{	
			e.printStackTrace();
		}
		catch (InstantiationException e) 
		{
			e.printStackTrace();
		}
		catch (Exception e) 
		{
			e.printStackTrace();
		}		
		
		if(indexofbuffer2==-1)
			indexofbuffer2= getFieldinbuffer( (Querybuffer[0]),lhs);
		/*Querybuffer[0] = Addprefix.removerefix(Querybuffer[0]);
		Querybuffer[0]=Addprefix.addPrefix(Querybuffer[0],reporton);*/
		MergedBuffer merg = new MergedBuffer();
		this.buffer1 =merg.outerMergedBuffer(buffer1,Querybuffer, indexofbuffer1, indexofbuffer2).toString().split("\n"); 
		/*getIndexArray();
		String split[]=buffer1[0].split("\t");
		for(int i=0;i<index1.length;i++)
		{	
			heading.append(split[index1[i]]+"\t"); 
		}
		split=Querybuffer[0].split("\t");
		for(int i=0;i<index2.length;i++)
		{	
			heading.append(split[index2[i]]+"\t"); 
		}
		heading.append("\n");
		for(int i=1;i<buffer1.length;i++)
		{
			String splitbuffer1[] = buffer1[i].split("\t");
			for(int j=1;j<Querybuffer.length;j++)
			{
				try 
				{
					String splitbuffer2[] = Querybuffer[j].split("\t");
					if(splitbuffer1[indexofbuffer1].toLowerCase().equals(splitbuffer2[indexofbuffer2].toLowerCase()))
					{
						try 
						{
							for(int k=0;k<index1.length;k++)
								Finalresult.append(splitbuffer1[index1[k]]+"\t");
						}
						catch (Exception e) 
						{
							//e.printStackTrace();
						}
						try 
						{
							for(int k=0;k<index2.length;k++)
								Finalresult.append(splitbuffer2[index2[k]]+"\t");
						}
						catch (Exception e) 
						{	
							//e.printStackTrace();
						}
						Finalresult.append("\n");
					}
				}
				catch (Exception e) 
				{
					//e.printStackTrace();
				}
				
			}
		}
		heading.append(Finalresult);
		*/ 
		this.buffer1 = removeDuplicateRecord(buffer1);
		//this.buffer1 = (heading.toString().split("\n"));
	}

	public String getObject() 
	{
		return object;
	}

	public String[] getbuffer() 
	{
		return buffer1;
	}

	public void initializeData()
	{

		RecordSearch rs =new RecordSearch(database);
		Hashtable<Object, Object> table =new Hashtable<Object, Object>();
		table.put("mid", object);
		table.put("td", "null");
		rs.setConditionMap(table);
		String result[] = rs.getArrayFromResultSet();
		for(int i=0;i<result.length;i++)
		{
			String splitresult[] = result[i].split("\t");
			String value = splitresult[Column.pv_index-1];
			if(value.equals("0"))
				value  = splitresult[Column.vt_index-1];
			else
				value = gid.getItem(value);
			joinmap.put(splitresult[Column.pid_index-1],value );
		}
		
}

	public void setDbmanager(DBManager database)
	{
		this.database = database;
		gid = new GetIdName(database);
		LHS = gid.getId(LHS);
		RHS = gid.getId(RHS);
		JOIN = gid.getId(JOIN);
		conditionopeartor = gid.getId(conditionopeartor);
	}

	public void setbuffer(String[] buffer) 
	{
		this.buffer1 = buffer;
	}
	public int getFieldinbuffer(String buffer,String Field)
	{
		String split[] = buffer.split("\t");
		for(int i=0;i<split.length;i++)
		{	
			
			if(split[i].toLowerCase().equals(Field.toLowerCase()))
				return i;
		}
		return -1;
	}
	 public void getIndexArray()
	 {
		 String split1[] = buffer1[0].split("\t");
		 String split2[] = Querybuffer[0].split("\t");
		 index1 = new int[split1.length];
		 index2 = new int[split2.length-1];
		 int count=0;
		 for(int i=0;i<split1.length;i++)
		 {
			 index1[count] =i;
			 count++;
		 }
		 count=0;
		 for(int i=0;i<split2.length;i++)
		 {
			 if(i!=indexofbuffer2)
			 {
				index2[count] = i;
			 	count++;
			 }	
		 }
	 }

	public String gettablename() 
	{
		return tablename;
	}

	public void setQuerybuffer(String[] Querybuffer) 
	{
		this.Querybuffer =Querybuffer;
	}

	public void settablename(String tablename) 
	{
		this.tablename = tablename;
	}
	public String[] getQuerybuffer() {
		return Querybuffer;
	}


	public void setKey(String key) 
	{
		this.key = key;
	}


	public void setValue(String value) 
	{
		this.value = value;
	}


	public String getkey() 
	{
		return key;
	}


	public String getvalue() 
	{
		return value;
	}


	public String getQueryName() 
	{
		return null;
	}

	public String [] removeDuplicateRecord(String[] buffer)
	{
		Hashtable<Object, Object> table =new Hashtable<Object, Object>();
		for(int i=1;i<buffer.length;i++)
		{
			table.put(buffer[i], "0");
		}
		String newbuffer[] = new String[table.size()+1];
		newbuffer[0] =buffer[0];
		int count=1;
		Enumeration<Object> enumfortable = table.keys();
		while(enumfortable.hasMoreElements())
		{
			newbuffer[count] = enumfortable.nextElement().toString();
			count++;
		}
		return newbuffer;
	}
	public void setQueryName(String QueryName) 
	{
	
		
	}
	public Hashtable<Object, Object> getQueryMap() 
	{
		return Querymap;
	}


	public void setQueryMap(Hashtable<Object, Object> QueryMap) 
	{
		this.Querymap = QueryMap;
	}


	public String gettid() 
	{
		return tid;
	}

	public void settid(String tid) 
	{
		this.tid =tid;	
	}


	public void addReport() 
	{
		getResult();
	}


	public void updateReport() 
	{
		getResult();
	}


	public String getReportname() 
	{
		return Reportname;
	}


	public void setReportName(String Reportname) 
	{
		this.Reportname = Reportname;
	}


	public void setreporton(String reporton) 
	{
	this.reporton =reporton;
	}


	public void setReportmap(Hashtable<Object, Object> ReportMap) 
	{
		
	}

	public void settypeofreport(String typeofreport) 
	{
		
	}
	public void setViewObject(String Object,char ch)
	{
		Splitstring sp =new Splitstring();
	    String splitobject[] = sp.split(Object,Character.toString(ch));
	    Order order = new Order(database);
	    Hashtable<Object, Object>table =order.getSequences(JOIN);
	    for(int j=0;j<table.size();j++)
	    {
		    for(int i=0;i<splitobject.length;i++)
	    	{
	    		joinmap.put(gid.getId(table.get(Integer.toString(j+1)).toString()), splitobject[i]);
	    		j++;
	    	}
	    }
	 }
	public void setViewObject(Vector<Object> PropertyMap) 
	{
		try 
		{
			joinmap.putAll((Map<? extends Object, ? extends Object>) PropertyMap.get(0));
		} catch (Exception e) 
		{
			
		}
	}

	
	public void buildQuery() {
		// TODO Auto-generated method stub
		
	}

	
	public String getQuery() {
		// TODO Auto-generated method stub
		return null;
	}

	
	public int getcount() {
		// TODO Auto-generated method stub
		return 0;
	}

	
	public void setCount(int count) {
		// TODO Auto-generated method stub
		
	}

	
	public void setMaxcount(int count) {
		// TODO Auto-generated method stub
		
	}

	
	public void setProcess(String process) {
		// TODO Auto-generated method stub
		
	}

	
	public void setQuery(String QueryName) {
		// TODO Auto-generated method stub
		
	}	



}
